A Performance Evaluation of Backtrack-Bounded Search Methods for N-ary Constraint Networks
نویسنده
چکیده
An early study on the structural aspect of binary constraint problems has led to the deenition of a backtrack bounded solving (bbs) method. In this paper, we apply this method to n-ary constraint problems and we try to weigh the beneets that can be expected from its use. Simple functions are described to implement bbs for acyclic n-ary problems and results of an experimental performance evaluation are given.
منابع مشابه
A Revised Su cient Condition for Backtrack-Free Search
In this paper, we deene the notion of !-consistency and !-graph associated with general n-ary constraint satisfaction problems and present an alternative suu-cient condition for backtrack-free search; that is, if the hypergraph associated with a general CSP has a tree-structured !-graph, then enforcing !-consistency enables the CSP to be solved by search without backtracking. We then show that ...
متن کاملA Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze the effects of polynomial-spacebounded learning on runtime complexity of backtrack search. One space-bounded learning scheme records only those constraints with limited size, and another records arbitrarily large cons...
متن کاملce-Bounded Learning Algorith Constraint Satisfaction Problem
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze the effects of polynomial-spacebounded learning on runtime complexity of backtrack search. One space-bounded learning scheme records only those constraints with limited size, and another records arbitrarily large cons...
متن کاملEnhancing Finite Set Constraint Programming with Probe Backtrack Search
Finite Set constraint programming (FS) offers a very expressive language to formalize combinatorial problems. The primitives of FS are set variables and relations (e.g. subset, intersection, union, ...). Usually, finite set constraint systems have also syntactic abstractions for n− ary set relations, such as partition([S1 . . . Sn],M), which forces the n set variables to be pairwise disjoint an...
متن کاملA Memory Bounded Hybrid Approach to Distributed Constraint Optimization
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Current algorithms that solve general DCOP instances rely on two main techniques, search and dynamic programming. While search algorithms such as ADOPT maintain polynomial memory requirements for participating agents, they incur a large performance penalty to establish initi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993